BLOOM: BLoom filter based oblivious outsourced matchings
نویسندگان
چکیده
منابع مشابه
The Gaussian Bloom Filter
Modern databases tailored to highly distributed, fault tolerant management of information for big data applications exploit a classical data structure for reducing disk and network I/O as well as for managing data distribution: The Bloom filter. This data structure allows to encode small sets of elements, typically the keys in a key-value store, into a small, constant-size data structure. In or...
متن کاملOptimization of Bloom Filter Parameters for Practical Bloom Filter Based Epidemic Forwarding in DTNs
Epidemic forwarding has been proposed as a forwarding technique to achieve opportunistic communication in Delay Tolerant Networks. Even if this technique is well known and widely referred, one has to first deal with several practical problems before using it. In particular, in order to manage the redundancy and to avoid useless transmissions, it has been proposed to ask nodes to exchange inform...
متن کاملAdaptive Bloom Filter
A Bloom filter is a simple randomized data structure that answers membership query with no false negative and a small false positive probability. It is an elegant data compression technique for membership information, and has broad applications. In this paper, we generalize the traditional Bloom filter to Adaptive Bloom Filter, which incorporates the information on the query frequencies and the...
متن کاملA Robust Bloom Filter
A Bloom filter is a space-efficient randomized data structure representing a set for membership queries. Faults in Bloom filters, however, cannot guarantee no false negatives. In this paper, we present a simple redundancy scheme for detecting false negatives and tolerating false positives induced by faults in Bloom filters during normal operation. A spare hashing unit with a simple coding techn...
متن کاملThe Bitwise Bloom Filter
We present the Bitwise Bloom Filter, a data structure for maintaining counts for a large number of items. The bitwise filter is an extension of the Bloom filter, a space-efficient data structure for storing a large set efficiently by discarding the identity of the items being held while still being able to determine whether it is in the set or not, with high probability. We show how this idea c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: BMC Medical Genomics
سال: 2017
ISSN: 1755-8794
DOI: 10.1186/s12920-017-0277-y